Location:
Search - b tree
Search list
Description: 从输入文件中读取数据,构造最优二叉树,输入文件格式如下:
节点的值 出现概率
例如:
A 0.001
B 0.25-Read from the input file data, the optimal binary tree structure, input file format is as follows: node probability value such as: A 0.001B 0.25
Platform: |
Size: 926720 |
Author: 魏木木 |
Hits:
Description: b树实现源码,linux和unix下运行,速度快,极好用-b realize the tree source, linux and unix run, fast, excellent use
Platform: |
Size: 1118208 |
Author: tdnlw |
Hits:
Description: 对于给定的2 棵二叉树A和B，编程计算二叉树A是否为二叉树B的子树，二叉树B
是否为二叉树A的子树-For a given A and two binary tree B, calculated for the binary tree binary tree A subset of B tree, binary tree B is a binary tree A subset of the tree
Platform: |
Size: 2048 |
Author: 高溪辉 |
Hits:
Description: 图书管理系统 C**实现的 包括B树
可以参考一下呀
有需要联系我哈-Library management system, including C** realize B tree can refer to it, I have need to contact Kazakhstan
Platform: |
Size: 252928 |
Author: 小崔 |
Hits:
Description: 首先，要知道B tree的主要元素是所謂的資料節點(node) ，每個資料節點內含有一些資料，以及指向其他資料節點的指標(pointer)。資料節點之間以枝幹相連，尾端就是枝葉(leaf) ，假設開始插入的資料順序為 : 1，2，3，4，5，6。以下就依照B tree的規則來種樹。-First of all, we know the main elements of B tree is the so-called information node (node), each data node contains some information, as well as other data point to the node indicator (pointer). Information between the nodes connected to the branches, that is the end of branches and leaves (leaf), the assumption that the information began to insert the following order: 1,2,3,4,5,6. On the B tree in accordance with the following rules to plant trees.
Platform: |
Size: 23552 |
Author: qq |
Hits:
Description: 一个关于B树结构的详细介绍，尤其是在数据库中利用其实现索引功能-B tree structure of a detailed introduction, especially in the database using its indexing realize
Platform: |
Size: 181248 |
Author: yuamei |
Hits:
Description: This utility has two views: (a) one view that will show you the entire PnP enumeration tree of device objects, including relationships among objects and all the device s reported PnP characteristics, and (b) a second view that shows you the device objects created, sorted by driver name. There is nothing like this utility available anywhere else.
Platform: |
Size: 649216 |
Author: 姜俞 |
Hits:
Description: b树的实现，包括打开关闭节点，打开节点
关闭节点，打开所有节点，关闭所有节点，
打开子节点，显示当前节点的增加节点
增加多个节点，删除节点-b-tree to achieve, including the closure of the node to open, open the node closed node, open to all nodes, the closure of all nodes, open the child nodes, indicating an increase in the current node node increased number of nodes, delete nodes
Platform: |
Size: 19456 |
Author: moyini |
Hits:
Description: 二叉树 数据结构 忘了是第几个实验 好像是第六个 用b树做的-Binary tree data structure is the first of several forgotten experiment seems to be the sixth to do with b tree
Platform: |
Size: 2048 |
Author: 409 |
Hits:
Description: 图书馆的图书管理系统，此系统为数据结构课程设计源代码，为B树实现。-Library' s library management system, the system data structure for curriculum design source code, for the B Tree implementation.
Platform: |
Size: 1552384 |
Author: ljy |
Hits:
Description: b-树的增加,因为我看到的资料里的最大关键字数目为m-1,我考虑了一下,2-3树的删除会比较麻烦,后来看了下算法导论,别人的数目是2t-1,所以相同情况下是2-3-4树,我考虑按照这个因子再写一个,增加删除部分,有问题可以联系我,联系方式在程序中已注明.-b-tree increases, because the information I have seen in the largest number of keywords for the m-1, I consider a bit ,2-3 tree removal would be more trouble, after reading An Introduction to the next algorithm, the number of people are 2t-1, so the same circumstances are 2-3-4 tree, I consider this factor in accordance with the write one, delete some of the increase, has problem can contact me, Contact us in the proceedings have been marked.
Platform: |
Size: 2048 |
Author: 杨毅 |
Hits:
Description: this is a Implementation of a B* tree,not yet completed, because I need help for this task.
Platform: |
Size: 22528 |
Author: digberth |
Hits:
Description: 数据结构B-TREE的java实现，按照CLRS的思路描述，通过测试~-a simple implemention of B-TREE（Java code） refer to CLRS
Platform: |
Size: 2048 |
Author: lili |
Hits:
Description: 樣板 B 樹 ( B - tree )
規則 :
(1) 每個節點內元素個數在 [MIN,2*MIN] 之間, 但根節點元素個數為 [1,2*MIN]
(2) 節點內元素由小排到大, 元素不重複
(3) 每個節點內的指標個數為元素個數加一
(4) 第 i 個指標所指向的子節點內的所有元素值皆小於父節點的第 i 個元素
(5) B 樹內的所有末端節點深度一樣-B model tree (B- tree) rules: (1) number of elements within each node in [MIN, 2* MIN], but the root node for the number of elements [1,2* MIN] (2) node elements from small into large, non-duplicate element (3) each node within the target number for the number of elements add 1 (4) Section i of the target point to a subset of nodes within the value of all the elements are less than the parent node the first i elements (5) B trees within the same depth of all the end nodes
Platform: |
Size: 8192 |
Author: 朱长春 |
Hits:
Description: 数据库的应用，基于索引，实现一个简单的B+树搜索树
-Database application, based on the index, the realization of a simple B+ tree search tree
Platform: |
Size: 9216 |
Author: julia |
Hits:
Description: Tokyo Cabinet的Tokyo Cabinet 是一个DBM的实现。这里的数据库由一系列key-value对的记录构成。key和value都可以是任意长度的字节序列,既可以是二进制也可以是字符串。这里没有数据类型和数据表的概念。
作者叫Mikio Hirabayashi.Tokyo Cabinet是用C写的，同时提供c,perl,ruby,java的API。Tokyo Cabinet在提供了POSIX和C99的平台上都可用，它以GNU Lesser Public License协议发布。-Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.Tokyo Cabinet is written in the C language, and provided as API of C, Perl, Ruby, Java, and Lua. Tokyo Cabinet is available on platforms which have API conforming to C99 and POSIX. Tokyo Cabinet is a free
software licensed under the GNU Lesser General Public License.
Platform: |
Size: 893952 |
Author: ws |
Hits:
Description: PEDUMP程序自从1994年的版本以来，已经有了明显的改善。它可以显示在PE里的每一个数据类型，包括：
IMAGE_NT_HEADERS
输入/输出表
资源
基址重定位
debug目录
延迟装入输入表
绑定输入描述符
IA-64异常处理表
TLS初始化数据
.NET运行时头部
除了可导出PE可执行文件外，PEDUMP也能导出COFF格式的OBJ文件、COFF输入库（新的和旧的格式）、COFF符号表和DBG文件。
PEDUMP是一个命令行程序，不带任何选项对我刚刚描述的文件类型去运行，将会有一个包括许多有用数据结构的缺省导出。几个可以有额外输出的选项列在如下：
＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝
/A dump里包括所有的内容
/B 显示基址重地位
/H 包括区段的16进制形式dump
/I 包括输入地址表thunk地址
/L 包括行号信息
/P 包括PDATA（运行时函数）
/R 包括详细的资源（字符串表和对话框）
/S 显示符号表 -dfdfdfdghhjjiww dkfd f skf df dfk skfdf k skf df
Platform: |
Size: 64512 |
Author: 王一 |
Hits:
Description: 基于 B- 树实现的图书管理系统1.rar-B-tree-based library management system to achieve 1.rar
Platform: |
Size: 10240 |
Author: city |
Hits:
Description: 数据结构课程设计 数据结构B+树
B+ tree Library-B+ tree Library
Platform: |
Size: 322560 |
Author: 刘煌 |
Hits:
Description: 数据结构的常用方法该视屏中包含：B树的删除，B树的生长过程，堆的排序，分块查找，直接插入排序，希尔排序，快速排序-Commonly used method of data structures contained in the screen: B-tree delete, B-tree growth process, heap sort, sub-block to find a direct insertion sort, Hill sort, quick sort, etc.
Platform: |
Size: 1712128 |
Author: 谭铭 |
Hits: